Region-Based Coding of Color Images Using Karhunen-Loeve Transform

نویسندگان

  • Dragana Carevic
  • Terry Caelli
چکیده

adaptive compression methods for color images. One, we use ferential pulse code modulation (DPCM) [25], transform clustering or segmentation procedures to determine self-similar coding [25, 30], and vector quantization [12], developed image regions. Two, for each such region we use a Karhunen– initially for encoding monochrome images. This approach Loeve compression method to model the important spatiois often restrictive, insofar as it fails to completely decorrechromatic information. Three, we employ linear prediction to late the source tristimulus signals and the redundancy reencode the resultant eigenimages. Finally, comparisons are tained between the color planes usually affects the coding made with current methods and improvements are demonperformance. Additionally, most of the standard algostrated particularly for low bit-rate coding of color textured rithms are based entirely on information theory, and, thereimages such as those that occur in aerial photography.  1997 fore, are not adapted to particular characteristics of images; Academic Press

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compression of image clusters using Karhunen Loeve transformations

This paper proposes to extend the Karhunen-Loeve compression algorithm to multiple images. The resulting algorithm is compared against single-image Karhunen Loeve as well as algorithms based on the Discrete Cosine Transformation (DCT). Futhermore, various methods for obtaining compressable clusters from large image databases are evaluated.

متن کامل

Fractal Compression Using the Discrete Karhunen-Loeve Transform

Fractal coding of images is a quite recent and eecient method whose major drawback is the very slow compression phase, due to a time-consuming similarity search between image blocks. A general acceleration method based on feature vectors is described, of which we can nd many instances in the litterature. This general method is then optimized using the well-known Karhunen-Loeve expansion, allowi...

متن کامل

Comparison of Image Approximation Methods: Fourier Transform, Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform

In this paper we compare the performance of several transform coding methods, Discrete Fourier Transform, Discrete Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform, commonly used in image compression systems through experiments. These methods are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.

متن کامل

Karhunen-Loeve Transform and Sparse Representation Based Plant Leaf Disease Recognition

To improve the classification accuracy rate of apple leaf disease images and solve the problem of dimension redundancy in feature extraction, Karhunen-Loeve (K-L) transform and sparse representation are applied to apple leaf disease recognition. Firstly 9 color features and 8 texture features of disease leaf images are extracted and taken as feature vectors after dimensionality reduction by the...

متن کامل

Optimal Y-u-v Model Based on Karhunen-loeve Transformation

An optimal Y-U-V transformation based on Karhunen-Loeve transformation for image compression proposed in this paper is considered as a spectral redundancy reduction. The PSNR is gained for optimal Y-U-V in comparison with traditional fixed Y-U-V transformation, because the variances are most separately after K-L transformation and the down sampling is taken on the coordinates with smallest vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CVGIP: Graphical Model and Image Processing

دوره 59  شماره 

صفحات  -

تاریخ انتشار 1997